An Algebraic Presentation of Term Graphs, via GS-Monoidal Categories
نویسندگان
چکیده
We present a categorical characterisation of term graphs (i.e., nite, directed acyclic graphs labeled over a signature) that parallels the well-known char-acterisation of terms as arrows of the algebraic theory of a given signature (i.e., the free Cartesian category generated by it). In particular, we show that term graphs over a signature are one-to-one with the arrows of the free gs-monoidal category generated by. Such a category satisses all the axioms for Cartesian categories but for the naturality of two transformations (the discharger ! and the duplicator r), providing in this way an abstract and clear relationship between terms and term graphs. In particular, the absence of the naturality of r and ! has a precise interpretation in terms of explicit sharing and of loss of implicit garbage collection, respectively.
منابع مشابه
A 2-Categorical Presentation of Term Graph Rewriting
It is well-known that a term rewriting system can be faithfully described by a cartesian 2-category, where horizontal arrows represent terms, and cells represent rewriting sequences. In this paper we propose a similar, original 2-categorical presentation for term graph rewriting. Building on a result presented in 8], which shows that term graphs over a given signature are in one-to-one correspo...
متن کاملOn Hierarchical Graphs: Reconciling Bigraphs, Gs-monoidal Theories and Gs-graphs
Compositional graph models for global computing systems must account for two relevant dimensions, namely nesting and linking. In Milner’s bigraphs the two dimensions are made explicit and represented as loosely coupled structures: the place graph and the link graph. Here, bigraphs are compared with an earlier model, gs-graphs, based on gs-monoidal theories and originally conceived for modelling...
متن کاملThe symmetric monoidal closed category of cpo $M$-sets
In this paper, we show that the category of directed complete posets with bottom elements (cpos) endowed with an action of a monoid $M$ on them forms a monoidal category. It is also proved that this category is symmetric closed.
متن کاملMonoidal Categories, Graphical Reasoning, and Quantum Computation
Graphs provide a natural mechanism for visualising many algebraic systems. They are particularly useful for describing algebras in a monoidal category, such as frobenius algebras and bialgebras, which play a vital role in quantum computation. In this context, terms in the algebra are represented as graphs, and algebraic identities as graph rewrite rules. To describe the theory of a more powerfu...
متن کاملOn GS-Monoidal Theories for Graphs with Nesting
We propose a sound and complete axiomatisation of a class of graphs with nesting and either locally or globally restricted nodes. Such graphs allow to represent explicitly and at the right level of abstraction some relevant topological and logical features of models and systems, including nesting, hierarchies, sharing of resources, and pointers or links. We also provide an encoding of the propo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Categorical Structures
دوره 7 شماره
صفحات -
تاریخ انتشار 1999